Quantum automorphism group of the lexicographic product of finite regular graphs
نویسندگان
چکیده
منابع مشابه
THE AUTOMORPHISM GROUP OF FINITE GRAPHS
Let G = (V,E) be a simple graph with exactly n vertices and m edges. The aim of this paper is a new method for investigating nontriviality of the automorphism group of graphs. To do this, we prove that if |E| >=[(n - 1)2/2] then |Aut(G)|>1 and |Aut(G)| is even number.
متن کاملQuantum Automorphism Groups of Finite Graphs
We determine the quantum automorphism groups of finite graphs. These are quantum subgroups of the quantum permutation groups defined by Wang. The quantum automorphism group is a stronger invariant for finite graphs than the usual automorphism group. We get a quantum dihedral group D4.
متن کاملThe Automorphism Group of a Product of Graphs
In a recent paper we showed that every connected graph can be written as a weak cartesian product of a family of indecomposable rooted graphs and that this decomposition is unique to within isomorphisms. Using this unique prime factorization theorem we prove that if a graph X can be written as a product of connected rooted graphs, which are pairwise relatively prime, then the automorphism group...
متن کاملThe automorphism group of the reduced complete-empty $X-$join of graphs
Suppose $X$ is a simple graph. The $X-$join $Gamma$ of a set ofcomplete or empty graphs ${X_x }_{x in V(X)}$ is a simple graph with the following vertex and edge sets:begin{eqnarray*}V(Gamma) &=& {(x,y) | x in V(X) & y inV(X_x) },\ E(Gamma) &=& {(x,y)(x^prime,y^prime) | xx^prime in E(X) or else x = x^prime & yy^prime in E(X_x)}.end{eqnarray*}The $X-$join graph $Gamma$ is said to be re...
متن کاملLexicographic Product of Extendable Graphs
Lexicographic product G◦H of two graphs G and H has vertex set V (G)×V (H) and two vertices (u1, v1) and (u2, v2) are adjacent whenever u1u2 ∈ E(G), or u1 = u2 and v1v2 ∈ E(H). If every matching of G of size k can be extended to a perfect matching in G, then G is called k-extendable. In this paper, we study matching extendability in lexicographic product of graphs. The main result is that the l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 2016
ISSN: 0021-8693
DOI: 10.1016/j.jalgebra.2016.01.036